Global optimization of bounded factorable functions with discontinuities

نویسندگان

  • Achim Wechsung
  • Paul I. Barton
چکیده

A deterministic global optimization method is developed for a class of discontinuous functions. McCormick’s method to obtain relaxations of nonconvex functions is extended to discontinuous factorable functions by representing a discontinuity with a step function. The properties of the relaxations are analyzed in detail; in particular, convergence of the relaxations to the function is established given some assumptions on the bounds derived from interval arithmetic. The obtained convex relaxations are used in a branch-andbound scheme to formulate lower bounding problems. Furthermore, convergence of the branch-and-bound algorithm for discontinuous functions is analyzed and assumptions are A. Wechsung Process Systems Engineering Laboratory, Department of Chemical Engineering, Massachusetts Institute of Technology, 77 Massachusetts Ave 66-363, Cambridge, MA 02139 E-mail: [email protected] P. I. Barton Process Systems Engineering Laboratory, Department of Chemical Engineering, Massachusetts Institute of Technology, 77 Massachusetts Ave 66-464, Cambridge, MA 02139 Tel.: +1 (617) 253-6526, Fax: +1 (617) 258-5042, E-mail: [email protected] 2 derived to guarantee convergence. A key advantage of the proposed method over reformulating the discontinuous problem as a MINLP or MPEC is avoiding the increase in problem size that slows global optimization. Several numerical examples for the global optimization of functions with discontinuities are presented, including ones taken from process design and equipment sizing as well as discrete-time hybrid systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relaxations of factorable functions with convex-transformable intermediates

We propose to strengthen standard factorable relaxations of global optimization problems through the use of functional transformations of intermediate expressions. In particular, we exploit convex transformability of the component functions of factorable programs as a tool in the generation of bounds. We define suitable forms of transforming functions and assess, theoretically and computational...

متن کامل

A Three-Coefficient Model with Global Optimization for Heavy End Characterization of Gas Condensate PVT Data

Characterization of heavy end, as plus fraction, is among the most crucial steps in predicting phase behavior of a hydrocarbon fluid system. Proper selection of single carbon number (SCN) distribution function is essential for heavy end characterization. The SCN distribution function is subject to fluid nature. The exponential distribution function has been and is widely applied to gas condensa...

متن کامل

Reachability Analysis and Deterministic Global Optimization of DAE Models

This article provides a tutorial overview of recent progress in numerical methods for the reachability analysis and deterministic global optimization of DAE models. These problems are highly interrelated, and are global problems in the sense that they concern the parametric solutions of a DAE model over a potentially large range of model parameters, rather than locally about a single value. Man...

متن کامل

Structure in Optimization: Factorable Programming and Functions

The purpose of this paper is to explore structures of functions in optimization. We will assume that the functions are composed of user-defined functions and are given as computer programs. Factorable functions and factorable programming problems were developed from 1967 through 1990 and are early examples of structure in nonlinear optimization. We explore the relationship between source code t...

متن کامل

TOPOLOGY OPTIMIZATION OF PLANE STRUCTURES USING BINARY LEVEL SET METHOD AND ISOGEOMETRIC ANALYSIS

This paper presents the topology optimization of plane structures using a binary level set (BLS) approach and isogeometric analysis (IGA). In the standard level set method, the domain boundary is descripted as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton–Jacobi equation. In the BLS method, the interfaces of subdomai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Global Optimization

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2014